Interval edge-colorings of graph products
نویسندگان
چکیده
An interval t coloring of a graph is a proper edgecoloring of with colors 1, such that at least one edge of G is colored by and the edges incident to each vertex − G G 2, , t ... , 1, 2, , , i i t = ... ( ) v V G ∈ are colored by consecutive colors, where is the degree of the vertex in . In this paper interval edge-colorings of various graph products are investigated. ( ) G d v ( ) G d v v G
منابع مشابه
Interval edge colorings of some products of graphs
An edge coloring of a graph G with colors 1, 2, . . . , t is called an interval t-coloring if for each i ∈ {1, 2, . . . , t} there is at least one edge of G colored by i, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable, if there is an integer t ≥ 1 for which G has an interval t-coloring. Let N be the set of all i...
متن کاملInterval edge-colorings of Cartesian products of graphs I
An edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if G has an interval t-coloring for some positive integer t. Let N be the set of all interval colorable graphs. For a graph G ∈ N, the least and the greatest va...
متن کاملOn Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees
A proper edge coloring of a graph with colors 1, 2, 3, . . . is called an interval coloring if the colors on the edges incident to each vertex form an interval of integers. A bipartite graph is (a, b)-biregular if every vertex in one part has degree a and every vertex in the other part has degree b. It has been conjectured that all such graphs have interval colorings. We prove that all (3, 6)-b...
متن کاملInterval Edge Colorings of Mobius Ladders
An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive colors, where d_{G}(x) is the degree of the vertex x in G. For Mobius ladders the existence of this coloring is proved and all possible numbers of colors in su...
متن کاملInterval cyclic edge-colorings of graphs
A proper edge-coloring of a graph G with colors 1, , t is called an interval cyclic t coloring if all colors are used, and the edges incident to each vertex ( ) v V G are colored with ( ) G d v consecutive colors by modulo t , where ( ) G d v is the degree of the vertex v in G . In this paper some properties of interval cyclic edge-colorings are investigated. Also, we give some bounds for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1110.1165 شماره
صفحات -
تاریخ انتشار 2011